Comparison between Single and Multi-Objective Evolutionary Algorithms to Solve the Knapsack Problem and the Travelling Salesman Problem
نویسندگان
چکیده
منابع مشابه
Approaches to the Travelling Salesman Problem Using Evolutionary Computing Algorithms
Genetic algorithms (GAs) were developed as problem independent search algorithms (Goldberg, 1989; Holland, 1975; Man et al., 1999), which simulate the biological evolution to search for an optimal solution to a problem. Figure 1(a) shows the main processes of genetic algorithms. When developing a genetic algorithm, we analyze the properties of the problem and determine the “gene encoding” polic...
متن کاملComparative Analysis of Evolutionary Algorithms for Multi-Objective Travelling Salesman Problem
The Evolutionary Computation has grown much in last few years. Inspired by biological evolution, this field is used to solve NP-hard optimization problems to come up with best solution. TSP is most popular and complex problem used to evaluate different algorithms. In this paper, we have conducted a comparative analysis between NSGA-II, NSGA-III, SPEA-2, MOEA/D and VEGA to find out which algorit...
متن کاملBioinspired Algorithm Applied to Solve the Travelling Salesman Problem
The article is devoted to the study and development of modified bioinspired algorithm and the experimental studies of its characteristics to solve the travelling salesman problem. This algorithm is part of the swarm intelligence method, which is one of bioinspired approaches describing the collective behavior of a decentralized self-organizing system and consists of a multitude of agents (ants)...
متن کاملThe multi-stripe travelling salesman problem
In the classical Travelling Salesman Problem (TSP), the objective function sums the costs for travelling from one city to the next city along the tour. In the q-stripe TSP with [Formula: see text], the objective function sums the costs for travelling from one city to each of the next q cities in the tour. The resulting q-stripe TSP generalizes the TSP and forms a special case of the quadratic a...
متن کاملA Study of Genetic Algorithm to Solve Travelling Salesman Problem
This paper presents the literature survey review of Travelling Salesman Problem (TSP). TSP belongs to the category of NP-hard problems. A various number of methods have been designed to solve this problem. Genetic Algorithm is one of the best methods which is used to solve various NP-hard problem such as TSP. The natural evolution process is always used by genetic Algorithm to solve the problem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2020
ISSN: 2227-7390
DOI: 10.3390/math8112018